A distance assignment approach to the facility layout problem

نویسندگان

  • Meir J. Rosenblatt
  • Boaz Golany
چکیده

The facility layout problem has generally been formulated as a quadratic assignment problem, where the interacting facilities are assigned to the various sites. In this paper a different approach, based on assigning distances between pairs of sites to pairs of facilities, is taken. A network formulation and analysis of this problem is provided. An algorithm, composed of three phases, is developed. The first phase involves preprocessing of the distance matrix. The second phase involves solving the (generalized assignment) network problem. The third phase employs a heuristic procedure which transforms the solution of the second phase into a feasible assignment of facilities to sites. Finally, computational experience with the new algorithm is provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...

متن کامل

Applications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)

Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

متن کامل

Offering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem

Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...

متن کامل

A Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA

A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...

متن کامل

Performance Analysis of Dynamic and Static Facility Layouts in a Stochastic Environment

In this paper, to cope with the stochastic dynamic (or multi-period) problem, two new quadratic assignment-based mathematical models corresponding to the dynamic and static approaches are developed. The product demands are presumed to be dependent uncertain variables with normal distribution having known expectation, variance, and covariance that change from one period to the next one, randomly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003